Higher Braid Groups and Regular Semigroups from Polyadic-Binary Correspondence
نویسندگان
چکیده
In this note, we first consider a ternary matrix group related to the von Neumann regular semigroups and Artin braid (in an algebraic way). The product of special kind matrices (idempotent finite order) reproduces groups with their binary multiplication components. We then generalize construction higher arity case, which allows us obtain some degree versions our sense) groups. latter are connected generalized polyadic equation R-matrix introduced by author, differ from any version well-known tetrahedron higher-dimensional analogs Yang-Baxter equation, n-simplex equations. Coxeter symmetry defined, it is shown that these only in non-higher case.
منابع مشابه
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other cryptographically popular groups. As the first step to put the braid groups into the area of pseudorandomness, this article presents some cryptographic primitives under two related assumptions in braid groups. First, ...
متن کاملRegular ordered semigroups and intra-regular ordered semigroups in terms of fuzzy subsets
Let $S$ be an ordered semigroup. A fuzzy subset of $S$ is anarbitrary mapping from $S$ into $[0,1]$, where $[0,1]$ is theusual interval of real numbers. In this paper, the concept of fuzzygeneralized bi-ideals of an ordered semigroup $S$ is introduced.Regular ordered semigroups are characterized by means of fuzzy leftideals, fuzzy right ideals and fuzzy (generalized) bi-ideals.Finally, two m...
متن کاملFrom braid groups to mapping class groups
This paper is a survey of some properties of the braid groups and related groups, that lead to questions on mapping class groups. AMS Subject Classification: Primary 20F36. Secondary 57M99, 57N05.
متن کاملGroups That Together with Any Transformation Generate Regular Semigroups or Idempotent Generated Semigroups
Let a be a non-invertible transformation of a finite set and let G be a group of permutations on that same set. Then 〈G, a 〉 \G is a subsemigroup, consisting of all non-invertible transformations, in the semigroup generated by G and a. Likewise, the conjugates ag = g−1ag of a by elements g ∈ G generate a semigroup denoted 〈ag | g ∈ G〉. We classify the finite permutation groups G on a finite set...
متن کاملEmbeddings of graph braid and surface groups in right-angled Artin groups and braid groups
We prove by explicit construction that graph braid groups and most surface groups can be embedded in a natural way in right-angled Artin groups, and we point out some consequences of these embedding results. We also show that every right-angled Artin group can be embedded in a pure surface braid group. On the other hand, by generalising to rightangled Artin groups a result of Lyndon for free gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9090972